Second Order Duality in Multiobjective Programming With Generalized Convexity

The purpose of this paper is concerned with a class of multi objective programming problems in which the objective functions and constrained functions are twice differentiable and containing the support functions of a compact convex set. For such mathematic programming, to deal with its dual problem, first, the concept of second order ( , ) B p r   invexity is introduced. Further, the Mangasarian type second order dual model associated with the multi objective problem are formulated. Several weak, strong and strict converse dual theorems are established and proved by utilizing the new generalized convexity. The results extend and improve the corresponding results in the literature.